# a = 'c8e9aca0c6f2e5f3e8c4efe7a1a0d4e8e5a0e6ece1e7a0e9f3baa0e8eafae3f9e4eafae2eae4e3eaebfaebe3f5e7e9f3e4e3e8eaf9eaf3e2e4e6f2'
# b = ''
# for i in range(0,len(a),2):
#     hex = a[i:i+2]
#     b += chr(int(hex,16) - 128)
# print(b)
# import math
# def getEuler(prime1,prime2):
#     return (prime1-1)*(prime2-1)
# def getDkey(e,Eulervalue):
#     k = 1
#     while True:
#         if(((Eulervalue * k )+1) % e)==0:
#             (d,m)-divmod(Eulervalue * k + 1,e)
#             k += 1
# def Ming(c,d,n):
#     return pow(c,d,n)
# if __name__=='__main__':
#     p = 473398607161
#     q = 4511491
#     d = getDkey(17, getEuler(p,q))
#     print('私钥为： %d'%d)


# import gmpy2
# p = 473398607161
# q = 4511491
# e = 17
# a = (p - 1) * (q - 1)
# d = gmpy2.invert(e, a)
# print(d)

print(bool(False))
print(bool(True))
